منابع مشابه
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
The study of interval temporal logics on linear orders is a meaningful research area in computer science and artificial intelligence. Unfortunately, even when restricted to propositional languages, most interval logics turn out to be undecidable. Decidability has been usually recovered by imposing severe syntactic and/or semantic restrictions. In the last years, tableau-based decision procedure...
متن کاملAdding linear orders
We address the following question: Can we expand an NIP theory by adding a linear order such that the expansion is still NIP? Easily, if acl(A)=A for all A, then this is true. Otherwise, we give counterexamples. More precisely, there is a totally categorical theory for which every expansion by a linear order has IP. There is also an ω-stable NDOP theory for which every expansion by a linear ord...
متن کاملEpimorphisms Between Linear Orders
We study the relation on linear orders induced by order preserving surjections. In particular we show that its restriction to countable orders is a bqo.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1972
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700044749